Conformance Checking of Components Against Their Non-deterministic Specifications
نویسندگان
چکیده
Conformance checking of a component is a testing method to see if an implementation and its executable specification are behaviorally equivalent relative to any interactions performed on the implementation. Such checking is complicated by the presence of non-determinism in the specification: the specification may permit a set of possible behaviors. We present a new method to automatically derive a component that manages all of the angelic non-determinism for an arbitrary implementation/specification pair. The new component just plugs in; no instrumentation of any implementation is necessary. Conformance checking thus helps to keep high-level non-determinstic specifications of components and their low-level implementations in sync.
منابع مشابه
Checking the Conformance of Java Classes Against Algebraic Specifications
We present and evaluate an approach for the run-time conformance checking of Java classes against property-driven algebraic specifications. Our proposal consists in determining, at run-time, whether the classes subject to analysis behave as required by the specification. The key idea is to reduce the conformance checking problem to the runtime monitoring of contract-annotated classes, a process...
متن کاملRuntime Verification for Generic Classes with ConGu 2
Even though generics became quite popular in mainstream objectoriented (OO) languages, approaches for checking at runtime the conformance of such programs against formal specifications still lack appropriate support. In order to overcome this limitation within CONGU, a tool-based approach we have been developing to support runtime conformance checking of Java programs against algebraic specific...
متن کاملOnline Testing of Real-Time Systems Using UPPAAL: Status and Future Work
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based on a sound and complete randomized online testing algorithm and is implemented using symbolic state representation and manipulation techniques. We propose the notion of relativized timed input/output conformance as the f...
متن کاملGeneral Methods for Access Control Policy Verification
Access control systems are among the most critical of computer security components. Faulty policies, misconfigurations, or flaws in software implementations can result in serious vulnerabilities. To formally and precisely capture the security properties that access control should adhere to, access control models are usually written, bridging the gap in abstraction between policies and mechanism...
متن کاملSymbolic Input-Output Conformance Checking for Model-Based Mutation Testing
This paper presents an approach to use symbolic input output conformance checking for mutation-based test case generation. In this approach, a possibly non-deterministic action system model is used as basis for generating a number of mutants. Subsequently after the generation of mutants, the original model and the mutants are simultaneously symbolically executed and tested for conformance. Dist...
متن کامل